Logic in computer science - PDFSEARCH.IO - Document Search Engine

Logic in computer science
Results: 2713

#	Item
711	On η-Expansion in NbE and Type Casts Andreas Abel Department of Computer Science Ludwig-Maximilians-University Munich 13 October 2011 Add to Reading List Source URL: www2.tcs.ifi.lmu.de Language: English - Date: 2011-10-13 14:43:05 Mathematical logic Normalisation by evaluation Database normalization Ordered pair Data management Mathematics Lambda calculus Type theory
712	A Guide to VLISP, A Veried Programming Language Implementation J. D. Guttman L. G. Monk Add to Reading List Source URL: repository.readscheme.org Language: English - Date: 2010-10-22 08:04:41 Procedural programming languages Programming language implementation Logic in computer science PreScheme Scheme programming language Compiler construction Programming language Compiler Denotational semantics Software engineering Computing Programming language theory
713	Interconnection Semantics for Keyword Search in XML Sara Cohen∗ Yaron Kanza Technion—Israel Institute of Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2007-11-04 06:34:23 Complexity classes NP-complete problems Logic in computer science Graph connectivity Graph theory Tree Connectivity L Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
714	CCCG 2014, Halifax, Nova Scotia, August 11–13, 2014 Time, space, and precision: Revisiting classic problems in computational geometry with degree-driven analysis Jack Snoeyink∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2014-08-04 14:37:40 Analysis of algorithms Computational complexity theory Computer arithmetic Algorithm Mathematical logic Floating point Computational geometry Time complexity Model of computation Theoretical computer science Applied mathematics Computer science
715	Runtime Model Checking of Multithreaded C Programs using Automated Instrumentation Dynamic Partial Order Reduction and Distributed Checking ⋆ Ganesh Gopalakrishnan Add to Reading List Source URL: www.fm2008.abo.fi Language: English - Date: 2007-12-21 11:36:45 Application programming interfaces Parallel computing Model checking Formal methods Logic in computer science Principles of Programming Languages SPIN model checker Thread Formal verification Computing Computer science Computer programming
716	Horn Clause Solvers for Program Verification Nikolaj Bjørner, Arie Gurfinkel, Ken McMillan and Andrey Rybalchenko Microsoft Research, Software Engineering Institutute Abstract. Several recent symbolic model checking too Add to Reading List Source URL: research.microsoft.com Language: English - Date: 2015-04-11 16:07:03 Logic in computer science Formal methods Mathematical logic Predicate logic Rules of inference Resolution Horn clause Predicate transformer semantics Constraint logic programming Theoretical computer science Mathematics Logic
717	Granularity and Concurrent Separation Logic Jonathan Hayman Computer Laboratory, University of Cambridge Abstract. When defining the semantics of shared-memory concurrent programming languages, one conventionally has to Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2012-02-07 11:14:44 Concurrency Diagrams Petri net Mathematical logic Mathematics Heap Separation logic Theoretical computer science Models of computation Logic in computer science
718	A Bisimulation for Type Abstraction and Recursion Eijiro Sumii Benjamin C. Pierce University of Pennsylvania Add to Reading List Source URL: www.cis.upenn.edu Language: English - Date: 2005-01-18 15:06:02 Mathematics Models of computation Denotational semantics Lambda calculus Model theory Π-calculus Bisimulation Orbifold Theoretical computer science Applied mathematics Logic in computer science
719	CCCG 2013, Waterloo, Ontario, August 8–10, 2013 Maximum-Weight Planar Boxes in O(n2 ) Time (and Better) J´er´emy Barbay∗ Timothy M. Chan† Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2013-08-11 21:51:56 NP-complete problems Algorithm Mathematical logic Computational geometry Numerical software PROPT Mathematics Applied mathematics Theoretical computer science
720	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics

UPDATE